0.00/0.00 % Leo-III: Strategy 1 (for '60') 7.39/6.99 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 7.39/6.99 % [INFO] Parsing done (226ms). 7.39/6.99 % [INFO] Running in sequential loop mode. 7.39/6.99 % [CONFIG] Using configuration: timeout(60) with strategy 7.39/6.99 % [INFO] eprover registered as external prover. 7.39/6.99 % [INFO] cvc4 registered as external prover. 7.39/6.99 % [INFO] Parsing finished. Scanning for conjecture ... 7.39/6.99 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ... 7.39/6.99 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms). 7.39/6.99 % [INFO] Problem is higher-order (TPTP THF). 7.39/6.99 % [INFO] Type checking passed. Searching for refutation ... 7.39/6.99 % [INFO] Killing All external provers ... 7.39/6.99 % Time passed: 2529ms (effective reasoning time: 1810ms) 7.39/6.99 % Solved by strategy 7.39/6.99 % Axioms used in derivation (0): 7.39/6.99 % No. of inferences in proof: 19 7.39/6.99 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2529 ms resp. 1810 ms w/o parsing 7.39/6.99 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p 7.39/6.99 thf(mu_type, type, mu: $tType). 7.39/6.99 thf(mimplies_type, type, mimplies: (($i > $o) > (($i > $o) > ($i > $o)))). 7.39/6.99 thf(mimplies_def, definition, (mimplies = (^ [A:($i > $o)]: (mor @ (mnot @ A))))). 7.39/6.99 thf(mforall_prop_type, type, mforall_prop: ((($i > $o) > ($i > $o)) > ($i > $o))). 7.39/6.99 thf(mforall_prop_def, definition, (mforall_prop = (^ [A:(($i > $o) > ($i > $o)),B:$i]: ! [C:($i > $o)]: (A @ C @ B)))). 7.39/6.99 thf(mbox_type, type, mbox: (($i > ($i > $o)) > (($i > $o) > ($i > $o)))). 7.39/6.99 thf(mbox_def, definition, (mbox = (^ [A:($i > ($i > $o)),B:($i > $o),C:$i]: ! [D:$i]: (~ (A @ C @ D) | (B @ D))))). 7.39/6.99 thf(mdia_type, type, mdia: (($i > ($i > $o)) > (($i > $o) > ($i > $o)))). 7.39/6.99 thf(mdia_def, definition, (mdia = (^ [A:($i > ($i > $o)),B:($i > $o)]: (mnot @ (mbox @ A @ (mnot @ B)))))). 7.39/6.99 thf(msymmetric_type, type, msymmetric: (($i > ($i > $o)) > $o)). 7.39/6.99 thf(msymmetric_def, definition, (msymmetric = (^ [A:($i > ($i > $o))]: ! [B:$i,C:$i]: ((A @ B @ C) => (A @ C @ B))))). 7.39/6.99 thf(mvalid_type, type, mvalid: (($i > $o) > $o)). 7.39/6.99 thf(mvalid_def, definition, (mvalid = ('!' @ $i))). 7.39/6.99 thf(sk1_type, type, sk1: ($i > ($i > $o))). 7.39/6.99 thf(sk2_type, type, sk2: $i). 7.39/6.99 thf(sk3_type, type, sk3: $i). 7.39/6.99 thf(sk4_type, type, sk4: ($i > (($i > $o) > ($i > $i)))). 7.39/6.99 thf(1,conjecture,((! [A:($i > ($i > $o))]: ((msymmetric @ A) <= (mvalid @ (mforall_prop @ (^ [B:($i > $o)]: (mimplies @ B @ (mbox @ A @ (mdia @ A @ B))))))))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)). 7.39/6.99 thf(2,negated_conjecture,((~ (! [A:($i > ($i > $o))]: ((msymmetric @ A) <= (mvalid @ (mforall_prop @ (^ [B:($i > $o)]: (mimplies @ B @ (mbox @ A @ (mdia @ A @ B)))))))))),inference(neg_conjecture,[status(cth)],[1])). 7.39/6.99 thf(3,plain,((~ (! [A:($i > ($i > $o))]: (! [B:$i,C:$i]: ((A @ B @ C) => (A @ C @ B)) | ~ (! [B:$i,C:($i > $o)]: (~ (C @ B) | ! [D:$i]: (~ (A @ B @ D) | ~ (! [E:$i]: (~ (A @ D @ E) | ~ (C @ E)))))))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[2])). 7.39/6.99 thf(5,plain,(! [C:$i,B:($i > $o),A:$i] : ((~ (B @ A)) | (~ (sk1 @ A @ C)) | (sk1 @ C @ (sk4 @ C @ (B) @ A)))),inference(cnf,[status(esa)],[3])). 7.39/6.99 thf(7,plain,((sk1 @ sk2 @ sk3)),inference(cnf,[status(esa)],[3])). 7.39/6.99 thf(4,plain,(! [C:$i,B:($i > $o),A:$i] : ((~ (B @ A)) | (~ (sk1 @ A @ C)) | (B @ (sk4 @ C @ (B) @ A)))),inference(cnf,[status(esa)],[3])). 7.39/6.99 thf(15,plain,(! [C:$i,B:($i > $o),A:$i] : ((~ (B @ A)) | (B @ (sk4 @ C @ (B) @ A)) | ((sk1 @ sk2 @ sk3) != (sk1 @ A @ C)))),inference(paramod_ordered,[status(thm)],[7,4])). 7.39/6.99 thf(16,plain,(! [A:($i > $o)] : ((~ (A @ sk2)) | (A @ (sk4 @ sk3 @ (A) @ sk2)))),inference(pattern_uni,[status(thm)],[15:[bind(A, $thf(sk2)),bind(B, $thf(B)),bind(C, $thf(sk3))]])). 7.39/6.99 thf(34,plain,(! [A:($i > $o)] : ((~ (A @ sk2)) | (A @ (sk4 @ sk3 @ (A) @ sk2)))),inference(simp,[status(thm)],[16])). 7.39/6.99 thf(104,plain,(! [A:($i > $o)] : ((~ (~ (A @ sk2))) | (~ (A @ (sk4 @ sk3 @ (^ [B:$i]: ~ (A @ B)) @ sk2))))),inference(prim_subst,[status(thm)],[34:[bind(A, $thf(^ [C:$i]: ~ (B @ C)))]])). 7.39/6.99 thf(125,plain,(! [A:($i > $o)] : ((~ (A @ (sk4 @ sk3 @ (^ [B:$i]: ~ (A @ B)) @ sk2))) | (A @ sk2))),inference(cnf,[status(esa)],[104])). 7.39/6.99 thf(126,plain,(! [A:($i > $o)] : ((~ (A @ (sk4 @ sk3 @ (^ [B:$i]: ~ (A @ B)) @ sk2))) | (A @ sk2))),inference(simp,[status(thm)],[125])). 7.39/6.99 thf(170,plain,(! [D:($i > $o),C:$i,B:($i > $o),A:$i] : ((~ (B @ A)) | (~ (sk1 @ A @ C)) | (D @ sk2) | ((sk1 @ C @ (sk4 @ C @ (B) @ A)) != (D @ (sk4 @ sk3 @ (^ [E:$i]: ~ (D @ E)) @ sk2))))),inference(paramod_ordered,[status(thm)],[5,126])). 7.39/6.99 thf(180,plain,((~ (~ (sk1 @ sk3 @ sk2))) | (~ (sk1 @ sk2 @ sk3)) | (sk1 @ sk3 @ sk2)),inference(pre_uni,[status(thm)],[170:[bind(A, $thf(sk2)),bind(B, $thf(^ [E:$i]: ~ (sk1 @ sk3 @ E))),bind(C, $thf(sk3)),bind(D, $thf(sk1 @ sk3))]])). 7.39/6.99 thf(223,plain,((sk1 @ sk3 @ sk2) | (~ (sk1 @ sk2 @ sk3)) | (sk1 @ sk3 @ sk2)),inference(cnf,[status(esa)],[180])). 7.39/6.99 thf(224,plain,((sk1 @ sk3 @ sk2) | (~ (sk1 @ sk2 @ sk3))),inference(simp,[status(thm)],[223])). 7.39/6.99 thf(6,plain,((~ (sk1 @ sk3 @ sk2))),inference(cnf,[status(esa)],[3])). 7.39/6.99 thf(260,plain,($false | ~ ($true)),inference(rewrite,[status(thm)],[224,6,7])). 7.39/6.99 thf(261,plain,($false),inference(simp,[status(thm)],[260])). 7.39/6.99 % SZS output end Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p 7.39/6.99 % [INFO] Killing All external provers ... 7.39/6.99 FINAL WATCH: 6.8 CPU 2.8 WC 7.39/6.99 Killed 1 orphans 7.39/6.99 Killed 2 orphans 7.39/6.99 Killed 1 orphans 7.39/6.99 EOF